Isochronicity and Linearizability of Planar Polynomial Hamiltonian Systems
نویسندگان
چکیده
In this paper we study isochronicity and linearizability of planar polynomial Hamiltonian systems. First we prove a theorem which supports a negative answer to the following open question: Do there exist planar polynomial Hamiltonian systems of even degree having an isochronous center? stated by Jarque and Villadelprat in the J. Differential Equations 180 (2002), 334–373. Additionally we obtain some conditions for linearizability of complex cubic Hamiltonian systems.
منابع مشابه
Linearizability Problem of Resonant Degenerate Singular Point for Polynomial Differential Systems
The linearizability or isochronicity problem is one of the open problems for polynomial differential systems which is far to be solved in general. A progressive way to find necessary conditions for linearizability is to compute period constants. In this paper, we are interested in the linearizability problem of p :−q resonant degenerate singular point for polynomial differential systems. Firstl...
متن کاملCommuting Planar Polynomial Vector Fields for Conservative Newton Systems
We study the problem of characterizing polynomial vector fields that commute with a given polynomial vector field on a plane. It is a classical result that one can write down solution formulas for an ODE that corresponds to a planar vector field that possesses a linearly independent commuting vector field. This problem is also central to the question of linearizability of vector fields. Let f ∈...
متن کاملCalculation of generalized period constants via time-angle difference for complex analytic systems with resonant ratio
In the case of a critical point being a center, the isochronicity problem (or linearizability problem) is far to be solved in general. A progressive way to find necessary conditions for isochronicity is to compute period constants. In this paper, we establish a new recursive algorithm of calculation of the so-called generalized period constants. Furthermore, we verify the new algorithm by the e...
متن کاملIsochronicity and Commutation of Polynomial Vector Fields
We study a connection between the isochronicity of a center of a polynomial vector field and the existence of a polynomial commuting system. We demonstrate an isochronous system of degree 4 which does not commute with any polynomial system. We prove that among the Newton polynomial systems only the Lienard and Abel systems may commute with transversal polynomial fields. We give a full and const...
متن کاملAlgorithmic derivation of isochronicity conditions
This paper is concerned with obtaining the conditions under which the origin is an isochronous centre for certain planar polynomial systems. The necessity of these conditions is proved using a computer implementation of an algorithm first proposed by I.I.Pleshkan. Their sufficiency is then proved using various methods.
متن کامل